Node Query Preservation for Deterministic Linear Top-Down Tree Transducers
نویسندگان
چکیده
منابع مشابه
Node Query Preservation for Deterministic Linear Top-Down Tree Transducers
This paper discusses the decidability of node query preservation problems for XML document transformations. We assume a transformation given by a deterministic linear top-down data tree transducer (abbreviated as DLTV ) and an n-ary query based on runs of a tree automaton. We say that a DLTV Tr strongly preserves a query Q if there is a query Q′ such that for every document t, the answer set of...
متن کاملDeterministic Top-Down Tree Transducers with Iterated Lookahead
It is known that by iterating the look-ahead tree languages for deterministic topdown tree automata, more and more powerful recognizing devices are obtained. Let DR0 = DR, where DR is the class of all tree languages recognizable by deterministic top-down tree automata, and let, for n 1, DRn be the class of all tree languages recognizable by deterministic top-down tree automata with DRn 1 lookah...
متن کاملPreservation of Recognizability for Weighted Linear Extended Top-Down Tree Transducers
An open question in [FÜLÖP, MALETTI, VOGLER: Weighted extended tree transducers. Fundamenta Informaticae 111(2), 2011] asks whether weighted linear extended tree transducers preserve recognizability in countably complete commutative semirings. In this contribution, the question is answered positively, which is achieved with a construction that utilizes inside weights. Due to the completeness of...
متن کاملComposing extended top-down tree transducers
A composition procedure for linear and nondeleting extended top-down tree transducers is presented. It is demonstrated that the new procedure is more widely applicable than the existing methods. In general, the result of the composition is an extended top-down tree transducer that is no longer linear or nondeleting, but in a number of cases these properties can easily be recovered by a post-pro...
متن کاملTypechecking Top-Down Uniform Unranked Tree Transducers
We investigate the typechecking problem for XML queries: statically verifying that every answer to a query conforms to a given output schema, for inputs satisfying a given input schema. As typechecking quickly turns undecidable for query languages capable of testing equality of data values, we return to the limited framework where we abstract XML documents as labeled ordered trees. We focus on ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2015
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.2014fcp0014